Structural proof theory - PDFSEARCH.IO - Document Search Engine

Structural proof theory
Results: 38

#	Item
11	Summary of Mathematical Notation Jean-Raymond Abrial (ETHZ) March 2008 Purpose of this Presentation Add to Reading List Source URL: www.fm2008.abo.fi Language: English - Date: 2008-06-10 09:27:49 Modus ponens Inference Rule of inference Natural deduction Structural proof theory Logic Proof theory Sequent
12	Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010 Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2010-05-04 16:48:34 Complexity classes Computational resources Mathematical optimization Structural complexity theory Advice NTIME Probabilistically checkable proof NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
13	Coinductive big-step operational semantics Xavier Leroy a,∗ Herv´e Grall b a INRIA Paris-Rocquencourt Domaine de Voluceau, B.P. 105, 78153 Le Chesnay, France Add to Reading List Source URL: pauillac.inria.fr Language: English - Date: 2007-12-16 08:06:13 Logical syntax Theoretical computer science Logic in computer science Proof theory Coinduction Rule of inference Theorem Formal proof Structural induction Logic Mathematics Mathematical logic
14	1 A brief overview of Complexity Theory The following brief overview is intended as a teaser for students in an introductory course on Complexity Theory. Out of the tough came forth sweetness1 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:17 Probabilistic complexity theory Computational complexity theory Mathematical optimization Structural complexity theory NP-complete Complexity NP P versus NP problem Probabilistically checkable proof Theoretical computer science Applied mathematics Complexity classes
15	Computational Complexity Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:18 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem P Bounded-error probabilistic polynomial Interactive proof system Theoretical computer science Computational complexity theory Applied mathematics
16	Coinductive big-step operational semantics Xavier Leroy a,∗ Herv´e Grall b a INRIA Paris-Rocquencourt Domaine de Voluceau, B.P. 105, 78153 Le Chesnay, France Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2007-12-16 08:06:13 Logical syntax Theoretical computer science Logic in computer science Proof theory Coinduction Rule of inference Theorem Formal proof Structural induction Logic Mathematics Mathematical logic
17	Introduction to Complexity Theory { Lecture Notes Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Email: [removed] July 31, 1999 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2000-12-12 06:50:00 Complexity classes Mathematical optimization Structural complexity theory NP-complete Polynomial-time reduction P versus NP problem NP P-complete Probabilistically checkable proof Theoretical computer science Computational complexity theory Applied mathematics
18	ANNAUOF PUREAND APPLIEDLOGIC EISBVIER Annals of Pure and Applied Logic[removed]299 Add to Reading List Source URL: www.ihes.fr Language: English - Date: 2009-09-10 07:50:35 Cut-elimination theorem Sequent First-order logic Linear logic Craig interpolation Structural rule Propositional calculus Rule of inference Well-formed formula Logic Mathematical logic Proof theory
19	Witness Indistinguishable and Witness Hiding Protocols Uriel Feige, Adi Shamir Department of Applied Mathematics The Weizmann Institute of Science Rehovot 76100, Israel Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2004-04-12 23:16:13 Cryptographic protocols Probabilistic complexity theory Complexity classes Zero-knowledge proof Structural complexity theory Proof of knowledge Interactive proof system Non-interactive zero-knowledge proof IP Theoretical computer science Computational complexity theory Cryptography
20	normal proofs, cut free derivations and structural rules Greg Restall* School of Historical and Philosophical Studies, The University of Melbourne, Add to Reading List Source URL: consequently.org Language: English - Date: 2015-02-12 20:35:36 Mathematics Propositional calculus Deduction Natural deduction System L Modus ponens Cut-elimination theorem Sequent calculus Rule of inference Logic Mathematical logic Proof theory